t = int(input())
for _ in range(t):
n = int(input())
print(n)#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
#define ll long long int
#define forn for (int i = 0; i < n; i++)
#define form for (int i = 0; i < m; i++)
void solve()
{
ll n;
cin >> n;
cout << n << endl;
}
int main()
{
int tc;
cin >> tc;
while (tc--)
{
solve();
}
return 0;
}1264F - Beautiful Fibonacci Problem | 52A - 123-sequence |
1543A - Exciting Bets | 1714D - Color with Occurrences |
215B - Olympic Medal | 1445A - Array Rearrangment |
1351A - A+B (Trial Problem) | 935B - Fafa and the Gates |
1291A - Even But Not Even | 1269A - Equation |
441A - Valera and Antique Items | 1702C - Train and Queries |
816B - Karen and Coffee | 838D - Airplane Arrangements |
148B - Escape | 847G - University Classes |
1110A - Parity | 1215B - The Number of Products |
604C - Alternative Thinking | 1204C - Anna Svyatoslav and Maps |
322A - Ciel and Dancing | 1689B - Mystic Permutation |
1711B - Party | 1702D - Not a Cheap String |
1714F - Build a Tree and That Is It | 1703F - Yet Another Problem About Pairs Satisfying an Inequality |
610A - Pasha and Stick | 1200A - Hotelier |
1091A - New Year and the Christmas Ornament | 1352B - Same Parity Summands |